Generating output examples using bit blocks

ABSTRACT

Methods, systems, and apparatus, including computer programs encoded on computer storage media, for generating output examples using neural networks. One of the methods includes receiving a request to generate an output example of a particular type, accessing dependency data, and generating the output example by, at each of a plurality of generation time steps: identifying one or more current blocks for the generation time step, wherein each current block is a block for which the values of the bits in all of the other blocks identified in the dependency for the block have already been generated; and generating the values of the bits in the current blocks for the generation time step conditioned on, for each current block, the already generated values of the bits in the other blocks identified in the dependency for the current block.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application claims priority to U.S. Provisional Application No.62/509,051, filed on May 19, 2017, and claims priority to U.S.Provisional Application No. 62/628,910, filed on Feb. 9, 2018. Thedisclosures of the prior applications are considered part of and areincorporated by reference in the disclosure of this application.

BACKGROUND

This specification relates to generating output examples using neuralnetworks.

Neural networks are machine learning models that employ one or morelayers of nonlinear units to predict an output for a received input.Some neural networks include one or more hidden layers in addition to anoutput layer. The output of each hidden layer is used as input to thenext layer in the network, i.e., the next hidden layer or the outputlayer. Each layer of the network generates an output from a receivedinput in accordance with current values of a respective set ofparameters.

Some neural networks are recurrent neural networks. A recurrent neuralnetwork is a neural network that receives an input sequence andgenerates an output sequence from the input sequence. In particular, arecurrent neural network can use some or all of the internal state ofthe network from a previous time step in computing an output at acurrent time step.

An example of a recurrent neural network is a Long Short-Term Memory(LSTM) neural network that includes one or more LSTM memory blocks. EachLSTM memory block can include one or more cells that each include aninput gate, a forget gate, and an output gate that allow the cell tostore previous states for the cell, e.g., for use in generating acurrent activation or to be provided to other components of the LSTMneural network.

SUMMARY

This specification describes how a system implemented as computerprograms on one or more computers in one or more locations can generatean output example, e.g., conditioned on a context input.

This specification uses the term “configured” in connection with systemsand computer program components. For a system of one or more computersto be configured to perform particular operations or actions means thatthe system has installed on it software, firmware, hardware, or acombination of them that in operation cause the system to perform theoperations or actions. For one or more computer programs to beconfigured to perform particular operations or actions means that theone or more programs include instructions that, when executed by dataprocessing apparatus, cause the apparatus to perform the operations oractions.

Particular embodiments of the subject matter described in thisspecification can be implemented so as to realize one or more of thefollowing advantages.

By generating output examples bit block by bit block, high qualityoutput examples can be generated more quickly. In particular, byreducing the dependency requirements for bit blocks in the outputexample as described in this specification, additional speed ups can beachieved without much degradation in the quality of the output examples.Because the requirements are reduced as described in this specificationto leverage the structure of the output examples, the reduction independencies does not adversely affect the quality of the generatedoutput examples to any significant degree.

That is, by making use of dependency data as described in thisspecification instead of requiring that the bits in a given outputsample depend on the bits on all previously generated output samples,the described systems can generate output examples in fewer inferencesteps (referred to in this specification as “generation time steps”)than conventional systems that auto-regressively generate outputexamples while generating output examples of comparable quality to theconventional systems.

Moreover, the generation of the bit blocks can be parallelized,resulting in a significant decrease in the time required to generate anoutput example. That is, in implementations where parallelization isemployed, the time required to generate an output example is furtherreduced, because in addition to requiring fewer inference steps, some ofthe inference steps are performed in parallel.

For example, a waveform of speech that is an utterance of an input textsegment can be effectively and quickly generated using the techniquesdescribed in this specification.

The details of one or more embodiments of the subject matter describedin this specification are set forth in the accompanying drawings and thedescription below. Other features, aspects, and advantages of thesubject matter will become apparent from the description, the drawings,and the claims.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 shows an example neural network system.

FIG. 2 shows two example dependencies.

FIG. 3 shows another example dependency.

FIG. 4 is a flow diagram of an example process for generating an outputexample.

FIG. 5 is a flow diagram of an example process of generation at a singlegeneration time step.

Like reference numbers and designations in the various drawings indicatelike elements.

DETAILED DESCRIPTION

This specification generally describes techniques for generating outputexamples that include an ordered collection of output samples.

Some conventional systems generate output examples in an auto-regressivemanner. In particular, the conventional systems generate each givenoutput sample in the output example conditioned on the already generatedoutput samples that precede the given output sample in the order. Inother words, in order to generate a given output sample, theconventional systems must have already generated all of the outputsamples that precede the given output sample in the order. While thismay result in a high quality output example being generated, this strictdependency requirement requires the output example to be generated overmany generation time steps.

The system described in this specification, on the other hand, generatesoutput examples with reduced dependency requirements that do not requireall of the output samples that precede the given output sample in theorder to already have been generated to generate at least some of thebits of the given output sample. Because of the way in which thedependency is reduced, the output examples are still of a high qualitybut can be generated much quicker, i.e., over many fewer generation timesteps.

FIG. 1 shows an example neural network system 100. The neural networksystem 100 is an example of a system implemented as computer programs onone or more computers in one or more locations, in which the systems,components, and techniques described below can be implemented.

The neural network system 100 receives a context input 102 and generatesan output example 152 conditioned on the context input 102.

For example, the output example 152 can be a sequence of audio data,e.g., a waveform, that represents an utterance of a piece of text. Inthis example, the context input 102 can be the piece of text orlinguistic features of the piece of text.

As another example, the output example 152 can be an image and thecontext input 102 can be text describing the desired contents of theimage or a numeric representation of the desired contents of the image.

As another example, the output example 152 can be a video frame and thecontext input 102 can be a representation of the preceding frames in thevideo, i.e., the output example 152 is a prediction of the next frame inthe video.

As another example, the output example 152 can be a sequence of text andthe context input 102 can be audio data, i.e., the output example 152 isa transcription of an utterance captured by the audio data.

Generally, the output example 152 is an ordered collection of T, i.e.,multiple, N-bit samples, e.g., T 4-bit values, 8-bit values, 16-bitvalues, 24-bit values.

For example, when the output example is speech waveform, the outputexample 152 can be considered to be an ordered, i.e., by time,collection of TN-bit amplitude values or compressed or compandedamplitude values.

As another example, when the output example is an image, the outputexample 152 can be considered to be an ordered, i.e., by spatiallocation and color channel, collection of T N-bit color values.

The system generates the output example 152 using one or moreautoregressive neural networks 110.

Generally, at a given forward pass, each of the autoregressive neuralnetworks 110 is configured to generate values for a block of bits fromthe output example 152. Each block of bits includes a respectiveplurality of bits from the output example 152. In some implementations,each block of bits includes the same, fixed number of bits.

In particular, the system 100 maintains dependency data that partitionsthe T×N bits in the output example 152 into a plurality of blocks. Thedependency data partitions the bits such that each bit in the outputexample belongs to exactly one block. Example partitioning of the bitsinto blocks will be described in more detail below with reference toFIGS. 2 and 3.

The dependency data also defines a dependency for each block in theoutput example.

Generally, the dependency will specify that (i) one or morepredetermined initial blocks in the output example do not depend on anyother blocks in the output example but that (ii) each block other thanthe predetermined initial block(s) depends on at least one other blockin the output example.

For a first block to depend on a second block means that, as the outputexample is being generated, the values of the bits in the first blockwill depend on the values of the bits in the second block. That is, thevalues of the bits in the second block must have already been generatedin order to begin generating the values of the bits in the first block.

Example dependency schemes that can be reflected in the dependency dataare described below with reference to FIGS. 2 and 3.

Generally, the system 100 obtains the dependency data and uses the samemaintained dependency data for each output example that is generated bythe system 100.

Each of the autoregressive neural network(s) 110 is configured togenerate the values for a particular block of bits conditioned on thevalues of the bits in the blocks on which the particular block of bitsdepends and on the context input.

The autoregressive neural network 110 can be any appropriateautoregressive neural network 110 that has been configured to generatevalues for a block of bits at a given forward pass. For example, thenetwork 110 can be a convolutional-based neural network, e.g., amodified WaveNet or PixelCNN. As another example, the network 110 can bea recurrent neural network, e.g., a modified PixelRNN. That is, one ofthese neural networks can be modified so that the output layer generatesa respective score for each of a plurality of bit value combinations,i.e., instead of a score distribution over possible values for an entiresample. WaveNet is described in WaveNet: A Generative Model for RawAudio, available at https://arxiv.org/abs/1609.03499. PixelCNN andPixelRNN are described in Conditional Image Generation with PixelCNNDecoders, available at https://arxiv.org/abs/1606.05328 and PixelRecurrent Neural Networks available at https://arxiv.org/abs/1601.06759.

The system 100 generates the output example over multiple generationtime steps, i.e., by generating one or more blocks of bits at each ofthe multiple generation time steps.

At each generation time step, the system 100 identifies one or morecurrent blocks. A current block is a block for which, as of thegeneration time step, the values of the bits in all of the other blocksidentified in the dependency for the block have already been generated.

The system 100 then generates the values of the bits in the one or morecurrent blocks conditioned on, for each current block, the alreadygenerated values of the bits in the other blocks identified in thedependency for the current block.

For example, for a particular current block and at a given generationtime step, a particular autoregressive bit value neural network 110 canreceive the current block dependencies 108, i.e., the values of the bitsin the blocks on which the current block depends, and generate currentblock scores 112. In the example of FIG. 1, the current block scores 112include a respective score for each of a plurality of bit valuecombinations, with each bit value combination including a respective bitvalue for each of the bits in the current block. In particular, in theexample of FIG. 1, the current block includes 3 bits and the scoresinclude each possible combination of bit values for the 3 bits.

The system 100 can then select one of the bit value combinations inaccordance with the scores, e.g., by sampling in accordance with thescores or by selecting the highest scoring combination, and then assignthe values in the selected combination as the values for thecorresponding bits in the current block.

In some implementations, the system 100 uses only a singleautoregressive neural network 110 in generating the output example andgenerates only one block of bits at each generation time step.

In other implementations, the system 100 can generate multiple blocks ofbits in parallel at each generation time step (if multiple currentblocks have been identified as current blocks at the generation timestep). In these implementations, the system 100 can generate the blocksin parallel using multiple instances of the same network 110 or can usedifferent networks 110 for different ones of the current blocks. In thelatter case, as will be described in more detail below, each network 110is specific to a respective subset of the blocks and, when a currentblock at a given time step is in the subset assigned to the network 110,can be used to generate the current block while others of the networks110 are generating blocks.

While the description in this specification generally describes theoutput example being generated conditioned on a context input, in somecases the system 100 generates the output example 152 withoutconditioning on any context input.

Once the output example 152 has been generated, the system 100 canprovide the output example 152 as output, e.g., to a user device forpresentation or playback to a user or to another system.

FIG. 2 shows two example dependencies 200 and 250.

The example dependency 200 is an example of a dependency used byconventional systems that generate output examples in an auto-regressivemanner. In the example dependency 200, there are six blocks of bits andsix samples, the samples are ordered according to a sample order, andeach block of bits includes all N bits from a corresponding one of thesamples. The dependency then specifies that the block of bits for agiven sample is dependent on the blocks of bits for the samples that arebefore the given sample in the sample order. For example, the block 202corresponds to the last sample in the sample order and is thereforedependent on all of the shaded blocks 204, i.e., on all of the blockscorresponding to the other five samples. Thus, the output samplecorresponding to the block 202 is dependent on all of the samples beforeit in the sample order. The bit value neural network 110 then generatesscores 206 for various possible combinations of values for the bits inthe block 202 conditioned on the already generated values of the bits inthe shaded blocks 204 (and on the context input 102).

In the example dependency 250, however, there are still six samples, buta block of bits includes less than all of the bits in a sample. Inparticular, in the dependency 250, each block of bits includes half ofthe bits (N/2) in a given sample.

Thus, a block that includes the first half of the bits of a sample isdependent on the blocks of bits for the samples before the given samplein the sample order and the block that includes the second half of thebits in the sample is also dependent on the block that includes thefirst half of the bits in the sample.

For example, the block 252 which includes the second half of the bits inthe sixth sample is dependent on the shaded blocks 254 in the figure,i.e., all of the blocks that include bits from the five samples beforethe sixth sample in the sample order and the block that includes thefirst half of the bits in the sixth sample. The bit value neural network110 then generates scores 256 for various possible combinations ofvalues for the bits in the block 202, i.e., for the second half of thebits in the six sample, conditioned on the already generated values ofthe bits in the shaded blocks 254 (and on the context input 102), i.e.,on the values of the bits in the first five samples and the values ofthe first half of the bits in the sixth sample.

In both of the examples in FIG. 2, each block i) includes only bits froma single sample and ii) is dependent on all of the blocks before theblock in the sample order.

In some cases, however, each block includes bits from multiple differentsamples and some of the blocks do not depend on all of the precedingblocks, allowing for output examples to be generated quicker. Moregenerally, the dependency is not such that all of the block except thefirst blocks depend on all of the preceding blocks, i.e., at least someof the blocks do not depend on all of the preceding block.

FIG. 3 shows another example dependency 300.

In the example dependency 300, the blocks have been arranged into amatrix structure having a plurality of rows, i.e., with each blockhaving the same subscript being in the same row, and a plurality ofcolumns, i.e., with each block having the same letter being in the samecolumn.

In some cases, the matrix structure has not been reshaped and each blockis an n×t block, with n being the number of bits from each sample in theblock and t being the number of samples in the block. For example, blocka1 may be a 4×2 block that includes the first 4 bits from the first 2samples in the sample order or a 1×8 block that includes the first bitfrom the first 8 samples in the sample order.

In some other cases, the matrix structure has been reshaped and thereare N*r total bits along the row dimension and T/r total “samples” alongthe column dimension, where r is an integer greater than one. In thesecases, each block is a b×t block and there are N*r/b columns of blocksin the structure.

Additionally, the dependencies of the blocks in the dependency 300 havebeen restricted.

In particular, for each particular block of the plurality of blocks, thedependency identifies that the particular block is not dependent on anyblock that is more than H columns after the particular block in a rowthat is before the row of the particular block. In the example of FIG.3, H is 1 and all of the blocks that are the same color/shade in FIG. 3can all be generated at the same generation time step, i.e., can all beidentified as current blocks at the same generation time step. However,H can be fixed to be any positive integer.

For example, at the first generation time step, block al is the only onethat can be generated. At the second generation time step, block b1 isthe only one that can be generated. At the third generation time step,however, both block c1 and block a2 can be generated, because block c1is more than H columns after block a2 in a row that is before the row ofblock c1, i.e., is more than 1 column after block a2 in the row that isbefore the row of block c1. Skipping to the fifth generation time step,blocks a3, c2, and e1 can all be generated, i.e., can all be identifiedas current blocks at the fifth generation time step.

When more than one block can be identified as a current block at a givengeneration time step, different instances of the same auto-regressiveneural network can be used to generate the values for all of the currentblocks in parallel.

While not shown in FIG. 3, the dependencies of the blocks can be furtherrestricted. In particular, the dependencies can be restricted such that,for a given block in row i and column j, the dependency identifies thatthe given block depends only on the values of bits in: (i) blocks 1through j−1 in row i and, for each row i-k below row i, blocks 1 through(j−1+kH) of that row, with H being a fixed integer greater than one.

In these cases, the generation of the blocks can be further parallelizedby assigning a different autoregressive neural network to each row ofthe matrix structure or to a group of rows in the matrix structure. Inparticular, at each time step and for each row, the system determineswhether there is a block in the row that can be identified as a currentblock, i.e., as a block for which all of the other blocks identified inthe dependency for the block have already been generated and, if so,generates the block using the neural network specific to the row.

While the dependency shown in FIG. 3 has been restricted and thedependency described above has been further restricted, the dependenciesthat have been removed for any given block, i.e., the blocks on which agiven block is no longer dependent, but that the block would have beendependent on in a conventional scheme, have been selected to be theblocks that are least likely to impact the correct values for the bitsin the current block. Accordingly, the restriction of the dependencydoes not have an overly adverse effect on the quality of the generatedoutput example.

FIG. 4 is a flow diagram of an example process 400 for generating anoutput example. For convenience, the process 400 will be described asbeing performed by a system of one or more computers located in one ormore locations. For example, a neural network system, e.g., the neuralnetwork system 100 of FIG. 1, appropriately programmed, can perform theprocess 400.

The system receives a request to generate an output example (step 402).In particular, the request specifies a context input and requests thatan output example be generated conditioned on the context input. Forexample, the request can specify linguistic features of a text segmentand request that a waveform be generated that is a verbalization of thetext segment.

The system accesses dependency data that partitions the bits in theoutput example into blocks and assigns a dependency to each block (step404). As described above, the dependency data partitions each bit in theoutput example to exactly one block and indicates that all of the blocksexcept for one or more predetermined initial blocks depend on one ormore other blocks in the output example.

The system generates the output example by generating one or more blocksat each of multiple generation time steps (406). Generation at a giventime step is described below with reference to FIG. 5. That is, thesystem continues performing the process described below with referenceto FIG. 5 until values for all of the bits in the output example havebeen generated.

FIG. 5 is a flow diagram of an example process 500 for generation at asingle time step. For convenience, the process 500 will be described asbeing performed by a system of one or more computers located in one ormore locations. For example, a neural network system, e.g., the neuralnetwork system 100 of FIG. 1, appropriately programmed, can perform theprocess 500.

The system identifies one or more current blocks for the time step (step502). As described above, the system identifies as current blocks allblocks that have not yet been generated but for which the dependency issatisfied. The dependency for a block is satisfied when all of theblocks on which the block depends on have already been generated.

The system generates a respective likelihood distribution for eachidentified current block (step 504). The likelihood distribution for agiven current block is a likelihood distribution over possible valuecombinations, with each value combination assigning a respective bitvalue for each of the bits in the current block.

The system can generate the likelihood distribution for the currentblock by conditioning an auto-regressive neural network on the contextinput and on the blocks on which the current block depends. In somecases, as described above, the system generates multiple likelihooddistributions in parallel when multiple current blocks have beenidentified.

The system selects bit values for the bits in each current block fromthe likelihood distribution for the current block (step 506). That is,for each current block, the system selects a value combination from thepossible value combinations in accordance with the likelihooddistribution and assigns the respective bit values in the selected valuecombination to the corresponding bits in the current block. For example,the system can sample from the likelihood distribution or can select thevalue combination having the highest likelihood.

Embodiments of the subject matter and the functional operationsdescribed in this specification can be implemented in digital electroniccircuitry, in tangibly-embodied computer software or firmware, incomputer hardware, including the structures disclosed in thisspecification and their structural equivalents, or in combinations ofone or more of them.

Embodiments of the subject matter described in this specification can beimplemented as one or more computer programs, i.e., one or more modulesof computer program instructions encoded on a tangible non transitoryprogram carrier for execution by, or to control the operation of, dataprocessing apparatus. Alternatively or in addition, the programinstructions can be encoded on an artificially generated propagatedsignal, e.g., a machine-generated electrical, optical, orelectromagnetic signal, that is generated to encode information fortransmission to suitable receiver apparatus for execution by a dataprocessing apparatus. The computer storage medium can be amachine-readable storage device, a machine-readable storage substrate, arandom or serial access memory device, or a combination of one or moreof them.

The term “data processing apparatus” encompasses all kinds of apparatus,devices, and machines for processing data, including by way of example aprogrammable processor, a computer, or multiple processors or computers.The apparatus can include special purpose logic circuitry, e.g., an FPGA(field programmable gate array) or an ASIC (application specificintegrated circuit). The apparatus can also include, in addition tohardware, code that creates an execution environment for the computerprogram in question, e.g., code that constitutes processor firmware, aprotocol stack, a database management system, an operating system, or acombination of one or more of them.

A computer program (which may also be referred to or described as aprogram, software, a software application, a module, a software module,a script, or code) can be written in any form of programming language,including compiled or interpreted languages, or declarative orprocedural languages, and it can be deployed in any form, including as astand-alone program or as a module, component, subroutine, or other unitsuitable for use in a computing environment. A computer program may, butneed not, correspond to a file in a file system. A program can be storedin a portion of a file that holds other programs or data, e.g., one ormore scripts stored in a markup language document, in a single filededicated to the program in question, or in multiple coordinated files,e.g., files that store one or more modules, sub programs, or portions ofcode. A computer program can be deployed to be executed on one computeror on multiple computers that are located at one site or distributedacross multiple sites and interconnected by a communication network.

The processes and logic flows described in this specification can beperformed by one or more programmable computers executing one or morecomputer programs to perform functions by operating on input data andgenerating output. The processes and logic flows can also be performedby, and apparatus can also be implemented as, special purpose logiccircuitry, e.g., an FPGA (field programmable gate array) or an ASIC(application specific integrated circuit).

Computers suitable for the execution of a computer program include, byway of example, can be based on general or special purposemicroprocessors or both, or any other kind of central processing unit.Generally, a central processing unit will receive instructions and datafrom a read only memory or a random access memory or both. The essentialelements of a computer are a central processing unit for performing orexecuting instructions and one or more memory devices for storinginstructions and data. Generally, a computer will also include, or beoperatively coupled to receive data from or transfer data to, or both,one or more mass storage devices for storing data, e.g., magnetic,magneto optical disks, or optical disks. However, a computer need nothave such devices. Moreover, a computer can be embedded in anotherdevice, e.g., a mobile telephone, a personal digital assistant (PDA), amobile audio or video player, a game console, a Global PositioningSystem (GPS) receiver, or a portable storage device, e.g., a universalserial bus (USB) flash drive, to name just a few.

Computer readable media suitable for storing computer programinstructions and data include all forms of non-volatile memory, mediaand memory devices, including by way of example semiconductor memorydevices, e.g., EPROM, EEPROM, and flash memory devices; magnetic disks,e.g., internal hard disks or removable disks; magneto optical disks; andCD ROM and DVD-ROM disks. The processor and the memory can besupplemented by, or incorporated in, special purpose logic circuitry.

To provide for interaction with a user, embodiments of the subjectmatter described in this specification can be implemented on a computerhaving a display device, e.g., a CRT (cathode ray tube) or LCD (liquidcrystal display) monitor, for displaying information to the user and akeyboard and a pointing device, e.g., a mouse or a trackball, by whichthe user can provide input to the computer. Other kinds of devices canbe used to provide for interaction with a user as well; for example,feedback provided to the user can be any form of sensory feedback, e.g.,visual feedback, auditory feedback, or tactile feedback; and input fromthe user can be received in any form, including acoustic, speech, ortactile input. In addition, a computer can interact with a user bysending documents to and receiving documents from a device that is usedby the user; for example, by sending web pages to a web browser on auser's client device in response to requests received from the webbrowser.

Embodiments of the subject matter described in this specification can beimplemented in a computing system that includes a back end component,e.g., as a data server, or that includes a middleware component, e.g.,an application server, or that includes a front end component, e.g., aclient computer having a graphical user interface or a Web browserthrough which a user can interact with an implementation of the subjectmatter described in this specification, or any combination of one ormore such back end, middleware, or front end components. The componentsof the system can be interconnected by any form or medium of digitaldata communication, e.g., a communication network. Examples ofcommunication networks include a local area network (“LAN”) and a widearea network (“WAN”), e.g., the Internet.

The computing system can include clients and servers. A client andserver are generally remote from each other and typically interactthrough a communication network. The relationship of client and serverarises by virtue of computer programs running on the respectivecomputers and having a client-server relationship to each other.

While this specification contains many specific implementation details,these should not be construed as limitations on the scope of anyinvention or of what may be claimed, but rather as descriptions offeatures that may be specific to particular embodiments of particularinventions. Certain features that are described in this specification inthe context of separate embodiments can also be implemented incombination in a single embodiment. Conversely, various features thatare described in the context of a single embodiment can also beimplemented in multiple embodiments separately or in any suitablesubcombination. Moreover, although features may be described above asacting in certain combinations and even initially claimed as such, oneor more features from a claimed combination can in some cases be excisedfrom the combination, and the claimed combination may be directed to asubcombination or variation of a subcombination.

Similarly, while operations are depicted in the drawings in a particularorder, this should not be understood as requiring that such operationsbe performed in the particular order shown or in sequential order, orthat all illustrated operations be performed, to achieve desirableresults. In certain circumstances, multitasking and parallel processingmay be advantageous. Moreover, the separation of various system modulesand components in the embodiments described above should not beunderstood as requiring such separation in all embodiments, and itshould be understood that the described program components and systemscan generally be integrated together in a single software product orpackaged into multiple software products.

Particular embodiments of the subject matter have been described. Otherembodiments are within the scope of the following claims. For example,the actions recited in the claims can be performed in a different orderand still achieve desirable results. As one example, the processesdepicted in the accompanying figures do not necessarily require theparticular order shown, or sequential order, to achieve desirableresults. In certain implementations, multitasking and parallelprocessing may be advantageous.

What is claimed is:
 1. A method comprising: receiving a request togenerate an output example of a particular type having TN-bit samples,wherein N and T are respective integers greater than one; accessingdependency data, wherein the dependency data: partitions the N*T bits inthe output example into a plurality of blocks of bits, each block ofbits comprising a respective plurality of bits from the output example,and for each of a plurality of the blocks, defines a respectivedependency for the block that identifies one or more other blocks in theplurality of blocks on which the values of the bits in the block depend;and generating the output example by, at each of a plurality ofgeneration time steps: identifying one or more current blocks for thegeneration time step, wherein each current block is a block for whichthe values of the bits in all of the other blocks identified in thedependency for the block have already been generated; and generating thevalues of the bits in the current blocks for the generation time stepconditioned on, for each current block, the already generated values ofthe bits in the other blocks identified in the dependency for thecurrent block.
 2. The method of claim 1, wherein, for generation timesteps at which a plurality of current blocks are identified, the currentblocks are generated in parallel.
 3. The method of claim 1, wherein thedependency data arranges the blocks into a matrix structure having aplurality of rows and a plurality of columns, and wherein, for eachparticular block of the plurality of blocks, the dependency identifiesthat the particular block is not dependent on any block that is morethan H columns after the particular block in a row that is before therow of the particular block, wherein H is a fixed positive integer. 4.The method of claim 3, wherein, for a given block in row i and column j,the dependency identifies that the given block depends only on thevalues of bits in: blocks 1 through j−1 in row i and, for each row i-kbelow row i, blocks 1 through (j−1+kH).
 5. The method of claim 4,wherein identifying one or more current blocks for the generation timestep comprises, determining, for each row of the plurality of rows,whether there is a block in the row for which all of the other blocksidentified in the dependency for the block have already been generated.6. The method of claim 5, wherein generating the values of the bits inthe current blocks for the generation time step conditioned on, for eachcurrent block, the already generated values of the bits in the otherblocks identified in the dependency for the current block comprises, foreach row in which a current block is identified: generating a networkinput that conditions an autoregressive neural network that is specificto the row on the values of the bits in the blocks identified in thedependency for the current block in the row; processing the networkinput using the autoregressive neural network that is specific to therow, wherein the autoregressive neural network is configured to processthe network input to generate a likelihood distribution over possiblevalue combinations, each possible value combination including arespective bit value for each of the bits in the current block;selecting a value combination from the possible value combinations inaccordance with the likelihood distribution, and assigning therespective bit values in the selected value combination to thecorresponding bits in the current block.
 7. The method of claim 5,wherein generating the values of the bits in the current blocks for thegeneration time step conditioned on, for each current block, the alreadygenerated values of the bits in the other blocks identified in thedependency for the current block comprises, for each current block:generating a network input that conditions an autoregressive neuralnetwork on the values of the bits in the blocks identified in thedependency for the current block; processing the network input using aninstance of the autoregressive neural network, wherein theautoregressive neural network is configured to process the network inputto generate a likelihood distribution over possible value combinations,each possible value combination including a respective bit value foreach of the bits in the current block; selecting a value combinationfrom the possible value combinations in accordance with the likelihooddistribution, and assigning the respective bit values in the selectedvalue combination to the corresponding bits in the current block.
 8. Themethod of claim 1, wherein each block also depends on a context input,and wherein generating the values of the bits in the current blocks isalso conditioned on the context input.
 9. A system comprising one ormore computers and one or more storage devices storing instructions thatwhen executed by the one or more computers cause the one or morecomputers to perform operations comprising: receiving a request togenerate an output example of a particular type having TN-bit samples,wherein N and T are respective integers greater than one; accessingdependency data, wherein the dependency data: partitions the N*T bits inthe output example into a plurality of blocks of bits, each block ofbits comprising a respective plurality of bits from the output example,and for each of a plurality of the blocks, defines a respectivedependency for the block that identifies one or more other blocks in theplurality of blocks on which the values of the bits in the block depend;and generating the output example by, at each of a plurality ofgeneration time steps: identifying one or more current blocks for thegeneration time step, wherein each current block is a block for whichthe values of the bits in all of the other blocks identified in thedependency for the block have already been generated; and generating thevalues of the bits in the current blocks for the generation time stepconditioned on, for each current block, the already generated values ofthe bits in the other blocks identified in the dependency for thecurrent block.
 10. The system of claim 9, wherein, for generation timesteps at which a plurality of current blocks are identified, the currentblocks are generated in parallel.
 11. The system of claim 9, wherein thedependency data arranges the blocks into a matrix structure having aplurality of rows and a plurality of columns, and wherein, for eachparticular block of the plurality of blocks, the dependency identifiesthat the particular block is not dependent on any block that is morethan H columns after the particular block in a row that is before therow of the particular block, wherein H is a fixed positive integer. 12.The system of claim 11, wherein, for a given block in row i and columnj, the dependency identifies that the given block depends only on thevalues of bits in: blocks 1 through j−1 in row i and, for each row i-kbelow row i, blocks 1 through (j−1+kH).
 13. The system of claim 12,wherein identifying one or more current blocks for the generation timestep comprises, determining, for each row of the plurality of rows,whether there is a block in the row for which all of the other blocksidentified in the dependency for the block have already been generated.14. The system of claim 13, wherein generating the values of the bits inthe current blocks for the generation time step conditioned on, for eachcurrent block, the already generated values of the bits in the otherblocks identified in the dependency for the current block comprises, foreach row in which a current block is identified: generating a networkinput that conditions an autoregressive neural network that is specificto the row on the values of the bits in the blocks identified in thedependency for the current block in the row; processing the networkinput using the autoregressive neural network that is specific to therow, wherein the autoregressive neural network is configured to processthe network input to generate a likelihood distribution over possiblevalue combinations, each possible value combination including arespective bit value for each of the bits in the current block;selecting a value combination from the possible value combinations inaccordance with the likelihood distribution, and assigning therespective bit values in the selected value combination to thecorresponding bits in the current block.
 15. The system of claim 13,wherein generating the values of the bits in the current blocks for thegeneration time step conditioned on, for each current block, the alreadygenerated values of the bits in the other blocks identified in thedependency for the current block comprises, for each current block:generating a network input that conditions an autoregressive neuralnetwork on the values of the bits in the blocks identified in thedependency for the current block; processing the network input using aninstance of the autoregressive neural network, wherein theautoregressive neural network is configured to process the network inputto generate a likelihood distribution over possible value combinations,each possible value combination including a respective bit value foreach of the bits in the current block; selecting a value combinationfrom the possible value combinations in accordance with the likelihooddistribution, and assigning the respective bit values in the selectedvalue combination to the corresponding bits in the current block. 16.The system of claim 9, wherein each block also depends on a contextinput, and wherein generating the values of the bits in the currentblocks is also conditioned on the context input.
 17. One or morecomputer storage media storing instructions that when implemented by oneor more computers cause the one or more computers to perform operationscomprising: receiving a request to generate an output example of aparticular type having TN-bit samples, wherein N and T are respectiveintegers greater than one; accessing dependency data, wherein thedependency data: partitions the N*T bits in the output example into aplurality of blocks of bits, each block of bits comprising a respectiveplurality of bits from the output example, and for each of a pluralityof the blocks, defines a respective dependency for the block thatidentifies one or more other blocks in the plurality of blocks on whichthe values of the bits in the block depend; and generating the outputexample by, at each of a plurality of generation time steps: identifyingone or more current blocks for the generation time step, wherein eachcurrent block is a block for which the values of the bits in all of theother blocks identified in the dependency for the block have alreadybeen generated; and generating the values of the bits in the currentblocks for the generation time step conditioned on, for each currentblock, the already generated values of the bits in the other blocksidentified in the dependency for the current block.
 18. The computerstorage media of claim 17, wherein, for generation time steps at which aplurality of current blocks are identified, the current blocks aregenerated in parallel.
 19. The computer storage media of claim 17,wherein the dependency data arranges the blocks into a matrix structurehaving a plurality of rows and a plurality of columns, and wherein, foreach particular block of the plurality of blocks, the dependencyidentifies that the particular block is not dependent on any block thatis more than H columns after the particular block in a row that isbefore the row of the particular block, wherein H is a fixed positiveinteger.
 20. The computer storage media of claim 19, wherein, for agiven block in row i and column j, the dependency identifies that thegiven block depends only on the values of bits in: blocks 1 through j−1in row i and, for each row i-k below row i, blocks 1 through (j−1+kH).